Strengths and Weaknesses of Quantum Computing

نویسندگان

  • Charles H. Bennett
  • Ethan Bernstein
  • Gilles Brassard
  • Umesh V. Vazirani
چکیده

Recently a great deal of attention has been focused on quantum computation following a sequence of results [Bernstein and Vazirani, in Proc. 25th Annual ACM Symposium Theory Comput., 1993, pp. 11–20, SIAM J. Comput., 26 (1997), pp. 1411–1473], [Simon, in Proc. 35th Annual IEEE Symposium Foundations Comput. Sci., 1994, pp. 116–123, SIAM J. Comput., 26 (1997), pp. 1474–1483], [Shor, in Proc. 35th Annual IEEE Symposium Foundations Comput. Sci., 1994, pp. 124–134] suggesting that quantum computers are more powerful than classical probabilistic computers. Following Shor’s result that factoring and the extraction of discrete logarithms are both solvable in quantum polynomial time, it is natural to ask whether all of NP can be efficiently solved in quantum polynomial time. In this paper, we address this question by proving that relative to an oracle chosen uniformly at random with probability 1 the class NP cannot be solved on a quantum Turing machine (QTM) in time o(2n/2). We also show that relative to a permutation oracle chosen uniformly at random with probability 1 the class NP ∩ co-NP cannot be solved on a QTM in time o(2n/3). The former bound is tight since recent work of Grover [in Proc. 28th Annual ACM Symposium Theory Comput., 1996] shows how to accept the class NP relative to any oracle on a quantum computer in time O(2n/2).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantum Computing in Power System Simulation

The concept of quantum computing has been conjectured as the next major breakthrough in computing. The basis of quantum computing, its strengths, weaknesses, and challenges are outlined. The specific application to electric power engineering is discussed.

متن کامل

The Investigation and Analysis of the Strengths, Weaknesses, Opportunities, and Threats of Wearable Electronic Technologies: A Systematic Review

Introduction: Wearable electronic devices, which are based on Internet of Things (IoT) and big data computing, are able to continuously collect and process the physiological and environmental data and exchange them with other tools, users, and internet networks. Therefore, despite their potential benefits in health monitoring, they can pose serious risks, especially in breach of privacy. Hence...

متن کامل

The Investigation and Analysis of the Strengths, Weaknesses, Opportunities, and Threats of Wearable Electronic Technologies: A Systematic Review

Introduction: Wearable electronic devices, which are based on Internet of Things (IoT) and big data computing, are able to continuously collect and process the physiological and environmental data and exchange them with other tools, users, and internet networks. Therefore, despite their potential benefits in health monitoring, they can pose serious risks, especially in breach of privacy. Hence...

متن کامل

Strengths and Weaknesses of Clinical Education Settings from the Viewpoint of Midwifery Students and Educators of Tabriz University of Medical Sciences

Background: Achieving a desirable clinical education requires continuous assessment of the current situations in clinical education and identifying the strengths and weaknesses. This study aimed to assess the strengths and weaknesses of the clinical education fields. Methods: This is a cross-sectional and descriptive study in which the strengths and weaknesses of clinical education settings wer...

متن کامل

Type-II Quantum Algorithms

We review and analyze the hybrid quantum-classical NMR computing methodology referred to as Type-II quantum computing. We show that all such algorithms considered so far within this paradigm are equivalent to some classical lattice-Boltzmann scheme. We derive a sufficient and necessary constraint on the unitary operator representing the quantum mechanical part of the computation which ensures t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Comput.

دوره 26  شماره 

صفحات  -

تاریخ انتشار 1997